Algorithms for Satisfiability using Independent Sets of Variables
نویسندگان
چکیده
An independent set of variables is one in which no two variables occur in the same clause in a given instance of k-SAT. Instances of k-SAT with an independent set of size i can be solved in time, within a polynomial factor of 2. In this paper, we present an algorithm for k-SAT based on a modification of the Satisfiability Coding Lemma. Our algorithm runs within a polynomial factor of 2 1 2k−2 , where i is the size of an independent set. We also present a variant of Schöning’s randomized local-search algorithm for k-SAT that runs in time which is with in a polynomial factor of ( 2k−3 k−1 ).
منابع مشابه
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due to a simple observation we prove that a k-SAT instance over n variables with independent set of size i can be solved in time O(φ2(k−1)(n− i)) where φk(n) denotes an upper bound on the complexity of solving k-SAT over n ...
متن کاملکاربرد مدل شبکه عصبی مصنوعی در پیش‌بینی پاسخ‌های آمیخته بیماری قلبی
Background: In epidemiological and medical studies, sometimes researchers are faced for prediction of two response variables (simultaneously) based on a number of independent variables. When the response variable is mixed, according to established limits and absence of assumption, the classical statistical methods are not enough efficient for classification and prediction goals. The p...
متن کاملSatisfiability-unsatisfiability transition in the adversarial satisfiability problem.
Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the transition are not easily parallel to those of S...
متن کاملSearching for Autarkies to Trim Unsatisfiable Clause Sets
An autarky is a partial assignment to the variables of a Boolean CNF formula that satisfies every clause containing an assigned variable. For an unsatisfiable formula, an autarky provides information about those clauses that are essentially independent from the infeasibility; clauses satisfied by an autarky are not contained in any minimal unsatisfiable subset (MUS) or minimal correction subset...
متن کاملThe SAT-UNSAT transition in the adversarial SAT problem
Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT and therefore the nature of the critical region and the transition are not easily paralleled to those of SAT and wor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004